Conic Scalarization Method in Multiobjective Optimization and Relations with Other Scalarization Methods

نویسندگان

  • Refail Kasimbeyli
  • Zehra Kamisli Ozturk
  • Nergiz Kasimbeyli
  • Gulcin Dinc Yalcin
  • Banu Icmen
چکیده

The paper presents main features of the conic scalarization method in multiobjective optimization. The conic scalarization method guarantee to generate all proper efficient solutions and does not require any kind of cenvexity or boundedness conditions. In addition the preference and reference point information of the decision maker is taken into consideretion by this method. Also in this paper, relations with other scalarization methods are investigeted and it is shown that the conic scalarization method is a generalization of the Benson's and PascolettiSerafini scalarization methods.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-objective Solution Approaches for Employee Shift Scheduling Problems in Service Sectors (RESEARCH NOTE)

Today, workforce scheduling programs are being implemented in many production and service centers. These sectors can provide better quality products and/or services to their customers, taking into account employees’ desires and preferences in order to increase sector productivity. In this study, an employee shift scheduling problem in the service sector is discussed. In the problem, the aim is ...

متن کامل

Computing Efficient Solutions of Nonconvex Multi-Objective Problems via Scalarization

This paper presents a new method for scalarization of nonlinear multi-objective optimization problems. We introduce a special class of monotonically increasing sublinear scalarizing functions and show that the scalar optimization problem constructed by using these functions, enables to compute complete set of weakly efficient, efficient, and properly efficient solutions of multi-objective optim...

متن کامل

A general approach for studying duality in multiobjective optimization

A general duality framework in convex multiobjective optimization is established using the scalarization with K-strongly increasing functions and the conjugate duality for composed convex cone-constrained optimization problems. Other scalarizations used in the literature arise as particular cases and the general duality is specialized for some of them, namely linear scalarization, maximum(-line...

متن کامل

Adaptive Scalarization Methods in Multiobjective Optimization

Only for you today! Discover your favourite adaptive scalarization methods in multiobjective optimization book right here by downloading and getting the soft file of the book. This is not your time to traditionally go to the book stores to buy a book. Here, varieties of book collections are available to download. One of them is this adaptive scalarization methods in multiobjective optimization ...

متن کامل

Parallel Implementation of Desirability Function-Based Scalarization Approach for Multiobjective Optimization Problems

Scalarization approaches are the simplest methods for solving the multiobjective problems. The idea of scalarization is based on decomposition of multiobjective problems into single objective sub-problems. Every one of these sub-problems can be solved in a parallel manner since they are independent with each other. Hence, as a scalarization approach, systematically modification on the desirabil...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015